Kleene Algebra with Converse
نویسندگان
چکیده
The equational theory generated by all algebras of binary relations with operations of union, composition, converse and reflexive transitive closure was studied by Bernátsky, Bloom, Ésik, and Stefanescu in 1995. We reformulate some of their proofs in syntactic and elementary terms, and we provide a new algorithm to decide the corresponding theory. This algorithm is both simpler and more efficient; it relies on an alternative automata construction, that allows us to prove that the considered equational theory lies in the complexity class PSpace. Specific regular languages appear at various places in the proofs. Those proofs were made tractable by considering appropriate automata recognising those languages, and exploiting symmetries in those automata.
منابع مشابه
Greedy-Like Algorithms in Kleene Algebra
This paper provides an algebraic background for the formal derivation of greedy-like algorithms. Such derivations have previously been done in various frameworks including relation algebra. We propose Kleene algebra as a particularly simple alternative. Instead of converse and residuation we use modal operators that are definable in a wide class of algebras, based on domain/codomain or image/pr...
متن کاملAnd Damien Pous A
Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations. We consider Kleene allegories, i.e., Kleene algebras with two additional operations and a constant which are natural in binary relation models: inter...
متن کاملRefactoring Heterogeneous Relation Algebras around Ordered Categories and Converse
We present a reorganisation of popular theories of “reasoning with relational flavour”, including allegories, Kleene algebras, and Dedekind categories, into an relatively symmetric picture using ordered categories as common base and defining converse independently from joins and meets. As an example application, we use this to regroup results about formalisation of algebraic graph rewriting and...
متن کاملPetri Automata
Kleene algebra axioms are complete with respect to both language models and binary relation models. In particular, two regular expressions recognise the same language if and only if they are universally equivalent in the model of binary relations. We consider Kleene allegories, i.e., Kleene algebras with two additional operations and a constant which are natural in binary relation models: inter...
متن کاملReasoning about Term Rewriting in Kleene Categories with Converse
This paper shows that “root-only” rewrite relations with respect to term rewriting systems can be expressed using Kleene star operations in a gs-monoidal Kleene category with converse. In our framework, we can analyze some properties of term rewriting systems by computing rewrite descendants of tree languages. As an application, we consider an infinite state model-checking problem given by a te...
متن کامل